package com.yitiao.data_algorithms.leetcode.editor.cn;

import java.util.ArrayList;
import java.util.List;

class PathInZigzagLabelledBinaryTree {
    // 2022-11-08 15:47:32
    public static void main(String[] args) {
        Solution solution = new PathInZigzagLabelledBinaryTree().new Solution();
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        // 找到上下两层元素的关系
        public List<Integer> pathInZigZagTree(int label) {
            List<Integer> ans = new ArrayList<>();


            return ans;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}